|
In computer science, Coq is an interactive theorem prover. It allows the expression of mathematical assertions, mechanically checks proofs of these assertions, helps to find formal proofs, and extracts a certified program from the constructive proof of its formal specification. Coq works within the theory of the calculus of inductive constructions, a derivative of the calculus of constructions. Coq is not an automated theorem prover but includes automatic theorem proving tactics and various decision procedures. The Association for Computing Machinery presented Coquand, Huet, Paulin-Mohring, Barras, Filliâtre, Herbelin, Murthy, Bertot, Castéran with the 2013 ACM Software System Award for Coq. == Overview == Seen as a programming language, Coq implements a dependently typed functional programming language,〔(A short introduction to Coq ),〕 while seen as a logical system, it implements a higher-order type theory. The development of Coq is supported since 1984 by INRIA, now in collaboration with École Polytechnique, University of Paris-Sud, Paris Diderot University and CNRS. In the 90's, École Normale Supérieure de Lyon was also part of the project. The development of Coq has been initiated by Gérard Huet and Thierry Coquand, after which more than 40 people, mainly researchers, contributed features of the core system. The implementation team has been successively coordinated by Gérard Huet, Christine Paulin and Hugo Herbelin. Coq is for the most part implemented in OCaml with a bit of C. The core system can be extended thanks to a mechanism of plug-ins. The word ''coq'' means "rooster" in French, and stems from a local tradition of naming a couple of French research development tools with animal names.〔(Coq Version 8.0 for the Clueless (174 Hints) ). Flint.cs.yale.edu. Retrieved on 2013-11-07.〕 Up to 1991, Coquand was implementing a language called the Calculus of Constructions and it was simply called CoC at this time. In 1991, a new implementation based on the extended Calculus of Inductive Constructions was started and the name changed from CoC to Coq, also an indirect reference to Thierry Coquand who developed the Calculus of Constructions along with Gérard Huet and the Calculus of Inductive Constructions along with Christine Paulin. Coq provides a specification language called Gallina〔 Adam Chlipala. "Certified Programming with Dependent Types": ("Library Universes" ). 〕(that means hen in spanish). Programs written in Gallina have the weak normalization property – they always terminate. This is one way to avoid the halting problem. This may be surprising, since infinite loops (non-termination) are common in other programming languages. 〔 Adam Chlipala. "Certified Programming with Dependent Types": ("Library GeneralRec" ). ("Library InductiveTypes" ). 〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Coq」の詳細全文を読む スポンサード リンク
|